On Reformulations of Nonconvex Quadratic Programs over Convex Cones by Set-semidefinite Constraints
نویسندگان
چکیده
The well-known result stating that any non-convex quadratic problem over the nonnegative orthant with some additional linear and binary constraints can be rewritten as linear problem over the cone of completely positive matrices (Burer, 2009) is generalized by replacing the nonnegative orthant with an arbitrary closed convex cone. This set-semidefinite representation result implies new semidefinite lower bounds for quadratic problems over several Bishop-Phelps cones.
منابع مشابه
Conic Reformulations and Approximations to Some Subclasses of Nonconvex
DENG, ZHIBIN. Conic Reformulations and Approximations to Some Subclasses of Nonconvex Quadratic Programming Problems. (Under the direction of Dr. Shu-Cherng Fang.) In this dissertation, some subclasses of nonconvex quadratic programming problems are studied. We first study the nonconvex quadratic programming problem over the standard simplex with application to copositive matrix detection. A se...
متن کاملOn the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
In the paper we prove that any nonconvex quadratic problem over some set K ⊆Rn with additional linear and binary constraints can be rewritten as linear problem over the cone, dual to the cone of K-semidefinite matrices. We show that when K is defined by one quadratic constraint or by one concave quadratic constraint and one linear inequality, then the resulting K-semidefinite problem is actuall...
متن کاملA General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
The class of POPs (Polynomial Optimization Problems) over cones covers a wide range of optimization problems such as 0-1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. This paper presents a new framework for convex relaxation of POPs over cones in terms of linear optimization problems over cones. It provides a unified treatment of many exis...
متن کاملQuadratic Programs with Hollows
Let F be a quadratically constrained, possibly nonconvex, bounded set, and let E1, . . . , El denote ellipsoids contained in F with non-intersecting interiors. We prove that minimizing an arbitrary quadratic q(·) over G := F\∪k=1 int(Ek) is no more difficult than minimizing q(·) over F in the following sense: if a given semidefinite-programming (SDP) relaxation for min{q(x) : x ∈ F} is tight, t...
متن کاملOn the Non-homogeneity of Completely Positive Cones
For a closed cone C in Rn, the completely positive cone of C is the convex cone K in Sn generated by {uuT : u ∈ C}. Completely positive cones arise, for example, in the conic LP reformulation of a nonconvex quadratic minimization problem over an arbitrary set with linear and binary constraints. Motivated by the useful and desirable properties of the nonnegative orthant and the positive semidefi...
متن کامل